Nonstandard arithmetic of iterated polynomials

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonstandard arithmetic and reverse mathematics

We show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard arithmetic. In the earlier paper [HKK1984] we introduced saturation principles in nonstandard arithmetic which are equivalent in strength to strong choice axioms in second order arithmetic. This paper studies principles ...

متن کامل

Nonstandard arithmetic and recursive comprehension

First order reasoning about hyperintegers can prove things about sets of integers. In the author’s paper Nonstandard Arithmetic and Reverse Mathematics, Bulletin of Symbolic Logic 12 (2006), it was shown that each of the “big five” theories in reverse mathematics, including the base theory RCA0, has a natural nonstandard counterpart. But the counterpart RCA0 of RCA0 has a defect: it does not im...

متن کامل

Arithmetic Nullstellensatz and Nonstandard Methods

In this study we find height bounds for polynomial rings over integral domains. We apply nonstandard methods and hence our constants will be ineffective. Furthermore we consider unique factorization domains and possible bounds for valuation rings and arithmetical functions.

متن کامل

Weak Theories of Nonstandard Arithmetic and Analysis

A general method of interpreting weak higher-type theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative extensions of primitive recursive arithmetic, elementary recursive arithmetic, and polynomial-time computable arithmetic. A means of formalizing basic real analysis in such theories is sketched. §

متن کامل

Bell Polynomials of Iterated Functions

Physics can be modeled by PDEs or recursively as iterated functions. A method is presented to decompose iterated functions into Bell polynomials and then into the combinatoric structure Schroeder’s Fourth Problem. Consistency with complex dynamics is shown by deriving the classification of fixed points in complex dynamics.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Manuscripta Mathematica

سال: 1990

ISSN: 0025-2611,1432-1785

DOI: 10.1007/bf02568493